The coarsest lattice that determines a discrete multidimensional system

نویسندگان

چکیده

A discrete multidimensional system is the set of solutions to a linear partial difference equations defined on lattice $$\mathbb {Z}^n$$ . This paper shows that it determined by unique coarsest sublattice, in sense this sublattice determine ; therefore correct domain definition system. In turn, defining Galois group symmetries leave invariant These results find application understanding properties such as controllability and autonomy, its order reduction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A multidimensional discrete Hilbert-type inequality

In this paper, by using the way of weight coecients and technique of real analysis, a multidimensionaldiscrete Hilbert-type inequality with a best possible constant factor is given. The equivalentform, the operator expression with the norm are considered.

متن کامل

Discrete heat kernel determines discrete Riemannian metric

The Laplace-Beltrami operator of a smooth Riemannian manifold is determined by the Riemannian metric. Conversely, the heat kernel constructed from the eigenvalues and eigenfunctions of the Laplace-Beltrami operator determines the Riemannian metric. This work proves the analogy on Euclidean polyhedral surfaces (triangle meshes), that the discrete heat kernel and the discrete Riemannian metric (u...

متن کامل

Permutation Symmetry Determines the Discrete Wigner Function.

The Wigner function provides a useful quasiprobability representation of quantum mechanics, with applications in various branches of physics. Many nice properties of the Wigner function are intimately connected with the high symmetry of the underlying operator basis composed of phase point operators: any pair of phase point operators can be transformed to any other pair by a unitary symmetry tr...

متن کامل

Simulation as Coarsest Partition Problem

The problem of determining the coarsest partition stable with respect to a given binary relation, is known to be equivalent to the problem of finding the maximal bisimulation on a given structure. Such an equivalence has suggested efficient algorithms for the computation of the maximal bisimulation relation. In this paper the simulation problem is rewritten in terms of coarsest stable partition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Control, Signals, and Systems

سال: 2022

ISSN: ['0932-4194', '1435-568X']

DOI: https://doi.org/10.1007/s00498-022-00318-1